Transformation of Intersected Two Regular Quadrangular Prisms
نویسندگان
چکیده
منابع مشابه
compactifications and representations of transformation semigroups
this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...
15 صفحه اولFull characterisation of attractors of two intersected asynchronous Boolean automata cycles
The understanding of Boolean automata networks dynamics takes an important place in various domains of computer science such as computability, complexity and discrete dynamical systems. In this paper, we make a step further in this understanding by focusing on their cycles, whose necessity in networks is known as the brick of their complexity. We present new results that provide a characterisat...
متن کاملQuadrangular algebras , by Richard
One of the best-known and most beautiful parts of mathematics is the classification of the simple Lie groups over the complex numbers. This was achieved in the late 1880s by Wilhelm Killing, whose work was remodelled by Élie Cartan in 1894, and it is now referred to as the Killing-Cartan classification. A Lie group is called simple if it has no non-trivial, connected, normal subgroups, and the ...
متن کاملQuadrangular embeddings of complete graphs∗
Hartsfield and Ringel proved that a complete graph Kn has an orientable quadrangular embedding if n ≡ 5 (mod 8), and has a nonorientable quadrangular embedding if n ≥ 9 and n ≡ 1 (mod 4). We complete the characterization of complete graphs admitting quadrangular embeddings by showing that Kn has an orientable quadrilateral embedding if n ≡ 0 (mod 8), and has a nonorientable quadrilateral embedd...
متن کاملFull characterization of attractors for two intersected asynchronous Boolean automata cycles
Nowadays, the understanding of Boolean automata networks dynamics takes an important place in various domains of computer science such as computability, complexity and discrete dynamical systems. Basing ourselves on these specific mathematical objects, in this paper, we make a step further in this understanding by focusing on their cycles, whose necessity in networks is known as the brick of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graphic Science of Japan
سال: 2006
ISSN: 1884-6106,0387-5512
DOI: 10.5989/jsgs.40.3_21